Unified Correspondence as a Proof-Theoretic Tool

نویسندگان

  • Giuseppe Greco
  • Minghui Ma
  • Alessandra Palmigiano
  • Apostolos Tzimoulis
  • Zhiguang Zhao
چکیده

The present paper aims at establishing formal connections between correspondence phenomena, well known from the area of modal logic, and the theory of display calculi, originated by Belnap. These connections have been seminally observed and exploited by Marcus Kracht, in the context of his characterization of the modal axioms (which he calls primitive formulas) which can be effectively transformed into ‘analytic’ structural rules of display calculi. In this context, a rule is ‘analytic’ if adding it to a display calculus preserves Belnap’s cut-elimination theorem. In recent years, the state-of-the-art in correspondence theory has been uniformly extended from classical modal logic to diverse families of nonclassical logics, ranging from (bi-)intuitionistic (modal) logics, linear, relevant and other substructural logics, to hybrid logics and mu-calculi. This generalization has given rise to a theory called unified correspondence, the most important technical tools of which are the algorithm ALBA, and the syntactic characterization of Sahlqvisttype classes of formulas and inequalities which is uniform in the setting of normal DLE-logics (logics the algebraic semantics of which is based on bounded distributive lattices). We apply unified correspondence theory, with its tools and insights, to extend Kracht’s results and prove his claims in the setting of DLE-logics. The results of the present paper characterize the space of properly displayable DLE-logics.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Towards Logical Frameworks in the Heterogeneous Tool Set Hets

LF is a meta-logical framework that has become a standard tool for representing logics and studying their properties. Its focus is proof theoretic, employing the Curry-Howard isomorphism: propositions are represented as types, and proofs as terms. Hets is an integration tool for logics, logic translations and provers, with a model theoretic focus, based on the meta-framework of institutions, a ...

متن کامل

Proofs as Programs

Suppose a formal proof of ∀x∃y Spec(x, y) is given, where Spec(x, y) is an atomic formula expressing some specification for naturalnumbers x, y. For any particular number n we then obtain a formal proof of ∃y Spec(n, y). Now the proof–theoretic normalization procedure yields another proof of ∃y Spec(n, y) which is in normal form. In particular, it does not use induction axioms any more, and it ...

متن کامل

Algebraic modal correspondence: Sahlqvist and beyond

This paper provides a bridge in the gap between the model-theoretic and the algebraic side of modal correspondence theory. We give a new, algebraic proof of the classical Sahlqvist correspondence theorem, as well as a new, algebraic proof of the analogous result for the atomic inductive formulas, which form a proper extension of the Sahlqvist class.

متن کامل

Algorithmic Correspondence and Canonicity for Possibility Semantics (Abstract)

Unified Correspondence. Correspondence and completeness theory have a long history in modal logic, and they are referred to as the “three pillars of wisdom supporting the edifice of modal logic” [22, page 331] together with duality theory. Dating back to [20,21], the Sahlqvist theorem gives a syntactic definition of a class of modal formulas, the Sahlqvist class, each member of which defines an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1603.08204  شماره 

صفحات  -

تاریخ انتشار 2016